Parallel Execution of Temporal Logic Programs Using Dataflow Computation
نویسندگان
چکیده
[ABSTRACT] The paper presents a data–driven execution model, CHEM, for a temporal logic programing language, Chronolog. An intermediate virtual machine is proposed, which is granulated at clause argument level to exploit argument parallelism through unification. Context–parallelism, inherent in temporal logic programs, is exploited through dynamic tagging approach typically used in dataflow computers. The model is process–based and supports AND–, OR–parallelism in the highly distributed dataflow environment. Implementation techniques used to support these forms of parallelism are described.
منابع مشابه
A parallel execution model for Chronolog
Temporal logic has been widely used as a formalism for program specification and verification [9, 12, 13], modelling temporal databases [1, 3, 14] and reasoning about time [8, 19, 20]. In temporal logic, the meanings of formulae depend on an implicit time parameter and elements from different moments in time can be combined through the use of temporal operators. Therefore, temporal logic can mo...
متن کاملSome Results on the Complexity of Exploiting Data Dependency in Parallel Logic Programs
D We consider several problems related to maintaining and analyzing dataflow dependencies in AND-parallel execution of logic programs. Several problems related to optimal selection of literals for parallel execution are established to be intractable (NP-complete). Most importantly, we establish intractability even when the arity of the predicates in the logic program is restricted to a small co...
متن کاملExperiences Implementing Dataflow On
| The MIT J-Machine 3], a massively-parallel computer, is an experiment in providing general-purpose mechanisms for communication, synchronization, and naming that will support a wide variety of parallel models of computation. We have developed two experimental data-ow programming systems for the J-Machine. For the rst system, we adapted Papadopoulos' explicit token store 10] to implement stati...
متن کاملDemand-Driven Dataflow for Concurrent Committed-Choice Code
Concurrent logic languages have been traditionally executed in a \greedy" fashion, such that computations are goal-driven. In contrast, non-strict functional programs have been traditionally executed in a \dataaow" fashion, such that computations are demand-driven. The latter method can be superior when allocation of resources such as memory is critical, which is usually the case for large, com...
متن کاملTag Management in a Reconfigurable Tagged-Token Dataflow Architecture
Combining dataflow concepts with reconfigurable computing provides a great potential to exploit the application parallelism efficiently. However, to express such parallelism cannot be a trivial task. Therefore, there is a great effort to automatically translate programs originally written in procedural languages (like C and Java) into dataflow architectures which express the parallelism in a na...
متن کامل